Efficient CORDIC-based systolic architectures for the discrete Hartley transform - Computers and Digital Techniques, IEE Proceedings-
نویسندگان
چکیده
The paper presents two new linear systolic architectures for the one-dimensional discrete Hartley transform (DHT). Both architectures exhibit several desired features such as regularity, modularity and high pipelineability, which make them amenable to VLSI hardware implementation. In addition these new architectures use the CORDIC (co-ordinate rotation digital computer) algorithm as the basic function for each PE (processing element) which has been shown to be an appealing approach to compute trigonometric functions. Combination of these two array processors to form a new fully pipelined meshconnected systolic architecture for the two-dimensional (2-D) DHT is also addressed. This new architecture, which uses Horner’s rule and the symmetric property of the transform by folding the data either in the time domain or in the frequency domain, yield higher throughput with reduced hardware complexity compared with other existing ones for both the 1-D and 2-D case.
منابع مشابه
Efficient systolic solution for a new prime factor discrete Hartley transform algorithm - Circuits, Devices and Systems, IEE Proceedings G
Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4 M , M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearl...
متن کاملBlock diagonal structure in discrete transforms - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
The author investigates and summarises some of the computational tasks of discrete transforms in which block diagonal structure plays a dominant role. Walsh-Hadamard transform (WHT) based algorithm designs for various well known discrete transforms are presented; it can be proved that, owing to their block diagonal structure, the WHT based discrete transforms are more efficient than those of th...
متن کاملTagged systolic arrays - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
Design of systolic arrays from a set of non-linear and nonuniform recurrence equations is discussed. A systematic method for deriving a systolic design in such cases is presented. A novel architectural idea, termed a tagged systolic array (TSA), is introduced. The design methodology described broadens the class of algorithms amenable for tagged systolic array implementation. The methodology is ...
متن کاملDesign of 2d Discrete Cosine Transform Using Cordic Architectures in Vhdl
The Discrete Cosine Transform is one of the most widely transform techniques in digital signal processing. In addition, this is also most computationally intensive transforms which require many multiplications and additions. Real time data processing necessitates the use of special purpose hardware which involves hardware efficiency as well as high throughput. Many DCT algorithms were proposed ...
متن کاملNovel Systolic Array Design for the Discrete Hartley Transform with High Throughput Rate
--In this paper, three attractive features for the DHT transform are derived, including (1)the Single/ Double Data Folding ; (2) the constructive feature and (3) the data reusage. By using CORDIC algorithm, The DHT Transform Kernel hm*[cose+ sine] and conjugate kernel h,*[cose-sln€I I can be simultanously determined. With these favorable properties, a novel systolic array design for the Discret...
متن کامل